A simple proof for the exponential upper bound for some tenacious patterns
نویسندگان
چکیده
منابع مشابه
Sub-exponential Upper Bound for #XSAT of some CNF Classes
We derive a worst upper bound on the number of models for exact satisfiability (XSAT) of arbitrary CNF formulas F. The bound can be calculated solely from the distribution of positive and negated literals in the formula. For certain subsets of CNF instances the new bound can be computed in subexponential time, namely in at most ( ) n O n , where n is the number of variables of F. A wider class ...
متن کاملSome Edge Cut Sets and an Upper bound for Edge Tenacity of Organic Compounds CnH2n+2
The graphs play an important role in our daily life. For example, the urban transport network can be represented by a graph, as the intersections are the vertices and the streets are the edges of the graph. Suppose that some edges of the graph are removed, the question arises, how damaged the graph is. There are some criteria for measuring the vulnerability of graph; the...
متن کاملA New Exponential Type Estimator for the Population Mean in Simple Random Sampling
In this paper, a new estimate of exponential type of auxiliary information to help simple random sampling without replacement of the finite population mean is introduced. This new estimator with a few other estimates using two real data sets are compared with the mean square error.
متن کاملSome properties of an upper bound for
| A convex upper bound of the mixed structured singular value is analyzed. The upper bound is based on a multiplier method. It is simple, it can exploit low-rank properties and it is shown to be less conservative than the well-known (D; G)-scaling. A direct relationship with (D; G)-scaling is given. The upper bound can be modiied to one that is continuous with an explicit Lipschitz constant. Ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2004
ISSN: 0196-8858
DOI: 10.1016/j.aam.2003.07.003